#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
class Solution
{
public:
    int removePalindromeSub(string s)
    {
        auto isPalindrome = [](string str) -> bool
        {   *max_element
            int n = str.length();
            for (int i = 0; i < n / 2; ++i)
            {
                if (str[i] != str[n - 1 - i])
                {
                    return false;
                }
                return true;
            }
        };
        int ans = 0, sLen = s.length();
        int i = 0, j = sLen - 1;
        while (i <= j)
        {
            string tempStr = "";
            if (isPalindrome(s.substr(i, j)))
            {
                tempStr = s.substr(0, i) + s.substr(j, sLen);
            }
        }

        return 0;
    }
};
int main()
{
    Solution s;
    cout << s.removePalindromeSub("asd") << endl;
    system("pause");
    return 0;
}
